A Compilation Based Approach to Conformant Probabilistic Planning with Stochastic Actions
نویسندگان
چکیده
We extend RBPP, the state-of-the-art, translation-based planner for conformant probabilistic planning (CPP) with deterministic actions, to handle a wide set of CPPs with stochastic actions. Our planner uses relevance analysis to divide a probabilistic ”failure-allowance” between the initial state and the stochastic actions. Using its ”initial-state allowance,” it uses relevance analysis to select a subset of the set of initial states on which planning efforts will focus. Then, it generates a deterministic planning problem using all-outcome determinization in which action cost reflects the probability of the modeled outcome. Finally, a cost-bounded classical planner generates a plan with failure probability lower than the ”stochastic-effect allowance.” Our compilation method is sound, but incomplete, as it may underestimates the success probability of a plan. Yet, it scales up much better than the state-of-the-art PFF planner, solving larger problems and handling tighter probabilistic bounds on existing benchmarks.
منابع مشابه
Translation based approaches to probabilistic planning
The main focus of our work is the use of classical planning algorithms in service of more complex problems of planning under uncertainty. In particular, we are exploring compilation techniques that allow us to reduce some probabilistic planning problems into variants of classical planning, such as metric planning, resource-bounded planning, and cost-bounded suboptimal planning. Currently, our i...
متن کاملUsing Classical Planners to Solve Conformant Probabilistic Planning Problems
Motivated by the success of the translation-based approach for conformant planning, introduced by Palacios and Geffner, we present two variants of a new compilation scheme from conformant probabilistic planning problems (CPP) to variants of classical planning. In CPP, we are given a set of actions – which we assume to be deterministic in this paper, a distribution over initial states, a goal co...
متن کاملCompiling Conformant Probabilistic Planning Problems into Classical Planning
In CPP, we are given a set of actions (assumed deterministic in this paper), a distribution over initial states, a goal condition, and a real value 0 < θ ≤ 1. We seek a plan π such that following its execution, the goal probability is at least θ. Motivated by the success of the translation-based approach for conformant planning, introduced by Palacios and Geffner, we suggest a new compilation s...
متن کاملA Translation Based Approach to Probabilistic Conformant Planning
In conformant probabilistic planning (CPP), we are given a set of actions with stochastic effects, a distribution over initial states, a goal condition, and a value 0 < p ≤ 1. Our task is to find a plan π such that the probability that the goal condition holds following the execution of π in the initial state is at least p. In this paper we focus on the problem of CPP with deterministic actions...
متن کاملCompilation Based Approaches to Probabilistic Planning - Thesis Summary
Models of planning under uncertainty, and in particular, MDPs and POMDPs have received much attention in the AI and DecisionTheoretic planning communities (Boutilier, Dean, and Hanks 1999; Kaelbling, Littman, and Cassandra 1998). These models allow for a richer and more realistic representation of real-world planning problems, but lead to increased complexity. Recently, a new approach for handl...
متن کامل